A fast tabu search algorithm for flow shop problem with blocking

This paper develops a fast tabu search algorithm to minimize makespan in a flow shop problem with blocking. We present a fast heuristic algorithm based on tabu search approach. In the algorithm the multimoves are used that consist in performing several moves simultaneously in a single iteration of algorithm and guide the search process to more promising areas of the solutions space, where good solutions can be found. It allow us to accelerate the convergence of the algorithm. Besides, in the algorithm a dynamic tabu list is used that assists additionally to avoid being trapped at a local optimum. The proposed algorithm is empirically evaluated and found to be relatively more effective in finding better solutions in a much shorter time.